Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Base donnée déductive")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 303

  • Page / 13
Export

Selection :

  • and

Towards efficient evaluation of methods by reductionKANDZIA, P.-T.Lecture notes in computer science. 1997, Vol 1341, pp 427-428, issn 0302-9743, isbn 3-540-63792-3Conference Paper

Bases de données déductives = Deductive databasesHACID, Mohand-Saïd; KOULOUMDJIAN, Jacques.Techniques de l'ingénieur. Informatique. 1997, Vol HB1, Num H2048, pp H2048.1-H2048.11, issn 0245-9612Article

Non-uniform hypothesis in deductive databases with uncertaintyLOYER, Yann; STRACCIA, Umberto.Lecture notes in computer science. 2002, pp 473-474, issn 0302-9743, isbn 3-540-43930-7, 2 p.Conference Paper

Representing inheritance and overriding in datalogDOBBIE, G; TOPOR, R.Computers and artificial intelligence. 1994, Vol 13, Num 2-3, pp 133-158, issn 0232-0274Article

Inductive logic databases : From extensional to intensional knowledgeFLACH, P. A.Lecture notes in computer science. 1997, Vol 1341, issn 0302-9743, isbn 3-540-63792-3, p. 3Conference Paper

Generalized query answering in disjunctive deductive databases : Procedural and nonmonotonic aspectsYAHYA, A. H.Lecture notes in computer science. 1997, pp 324-340, issn 0302-9743, isbn 3-540-63255-7Conference Paper

A method for integrating deductive databasesXU, L; POULOVASSILIS, A.Lecture notes in computer science. 1997, pp 215-231, issn 0302-9743, isbn 3-540-63263-8Conference Paper

GLUE : Opening the world to theorem proversNEUGEBAUER, G; SCHÄFER, D.Lecture notes in computer science. 1997, pp 410-419, issn 0302-9743, isbn 3-540-63255-7Conference Paper

Secure deductive databasesBARKER, Steve.Lecture notes in computer science. 2001, pp 123-137, issn 0302-9743, isbn 3-540-41768-0Conference Paper

Efficient reasoning using the local closed-world AssumptionDOHERTY, Patrick; ŁUKASZEWICZ, Witold; SZAŁAS, Andrzej et al.Lecture notes in computer science. 2000, pp 49-58, issn 0302-9743, isbn 3-540-41044-9Conference Paper

DOA : The deductive object-oriented approach to the development of adaptive natural language interfacesWINIWARTER, W; KAMBAYASHI, Y.Lecture notes in computer science. 1997, pp 137-138, issn 0302-9743, isbn 3-540-63263-8Conference Paper

Handling constraints and generating intensional answers in a deductive database systemGROSS, R; MARTI, R.Computers and artificial intelligence. 1994, Vol 13, Num 2-3, pp 233-256, issn 0232-0274Article

Inference by generating in deductive databases = Interference by... databasesLOZINSKII, E. I.Data & knowledge engineering. 1992, Vol 7, Num 4, pp 327-357, issn 0169-023XArticle

Les chemins de l'analyse statistique de données temporelles. I. Etapes et évaluation = The statistical analysis paths with time data : Stages and evaluationLOSLEVER, Pierre.Journal européen des systèmes automatisés. 2000, Vol 34, Num 8, pp 959-978, issn 1269-6935Article

Structuring the process of integrity maintenanceMAYOL, E; TENIENTE, E.Lecture notes in computer science. 1997, Vol 1308, pp 262-275, issn 0302-9743, isbn 3-540-63478-9Conference Paper

A knowledge model for unifying deductive and non-deductive heterogeneous databasesSIROUNIAN, L; GROSKY, W. I.IEEE transactions on knowledge and data engineering. 1995, Vol 7, Num 1, pp 82-105, issn 1041-4347Article

Extending SQL with generalized transitive closureSHAUL DAR; RAKESH AGRAWAL.IEEE transactions on knowledge and data engineering. 1993, Vol 5, Num 5, pp 799-812, issn 1041-4347Article

Inductive learning in deductive databases : Learning and discovery in knowledge-based databasesDZEROSKI, S; LAVRAC, N.IEEE transactions on knowledge and data engineering. 1993, Vol 5, Num 6, pp 939-949, issn 1041-4347Article

A sound and complete query evaluation for implicit predicate which is a semantic descriptor of unknown valuesYOON JOON LEE; JAE DONG YANG.Information processing letters. 1991, Vol 39, Num 5, pp 283-289, issn 0020-0190Article

Boundedness is undecidable for Datalog programs with a single recursive ruleABITEBOUL, S.Information processing letters. 1989, Vol 32, Num 6, pp 281-287, issn 0020-0190Article

Logic databases on the Semantic Web: Challenges and opportunitiesDECKER, Stefan.Lecture notes in computer science. 2002, pp 20-21, issn 0302-9743, isbn 3-540-43930-7, 2 p.Conference Paper

System description: DLVDELL'ARMI, Tina; FABER, Wolfgang; IELPA, Giuseppe et al.Lecture notes in computer science. 2001, pp 424-428, issn 0302-9743, isbn 3-540-42593-4Conference Paper

Règles pour les mises à jour des bases de données déductives = Update Rules for Deductive DatabasesHalfeld Ferrari Alves, Mirian; Spyratos, N.1996, 229 p.Thesis

Bottom-Up rewriting methods for Datalog and extensions : a survey. ICATANIA, B.Ingénierie des systèmes d'information (1993). 1995, Vol 3, Num 6, pp 637-676, issn 1247-0317Article

A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semanticsFAGES, F.New generation computing. 1991, Vol 9, Num 3-4, pp 425-443, issn 0288-3635Article

  • Page / 13